منابع مشابه
Pothole Detection by Soft Computing
Subject- Potholes on roads are regarded as serious problems in the transportation domain and ignoring them leads to the increase of accidents, traffic, vehicle fuel consumption and waste of time and energy. As a result, pothole detection has attracted researchers’ attention and different methods have been presented for it up to now. Background- The major part of previous research is based on i...
متن کاملComputing Szeged index of graphs on triples
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define t...
متن کاملOptimization Task Scheduling Algorithm in Cloud Computing
Since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. Presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. This rese...
متن کاملSecurity Challenges in Fog Computing in Healthcare
Background and Aim: The Fog Computing is a highly virtualized platform that provides storage, computing and networking services between the Cloud data centers and end devices. Fog computing fits the characteristics of real-time health monitoring systems. In such systems, a large amount of data is acquired from a multitude of bio and environmental sensors. On the other hand, its distribution and...
متن کاملComputing Vertex PI Index of Tetrathiafulvalene Dendrimers
General formulas are obtained for the vertex Padmakar-Ivan index (PIv) of tetrathiafulvalene (TTF) dendrimer, whereby TTF units we are employed as branching centers. The PIv index is a Wiener-Szeged-like index developed very recently. This topological index is defined as the summation of all sums of nu(e) and nv(e), over all edges of connected graph G.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1998
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-98-00977-6